منابع مشابه
Multiprocessor Task Scheduling Based on GEO Metaheuristic
In this paper we propose a solution of a multiprocessor task scheduling problem with use of a new meta-heuristic inspired by a model of natural evolution called Generalized Extremal Optimization (GEO). It is inspired by a simple coevolutionary model based on a Bak-Sneppen model. One of advantages of the model is a simple implementation of potential optimization problems and only one free parame...
متن کاملAnonymous Group Message Authentication Protocol for LTE-based V2X Communications
Correspondence Dongxiao Liu, Department of Electrical and Computer Engineering, University of Waterloo, Waterloo Canada N2L 3G1 Email: [email protected] Cellular technologies, in particular the current long-term evolution (LTE) and future 5G, are suitable for implementing vehicle-to-everything (V2X) services, due to the existing network infrastructure, device-to-device (D2D) communicati...
متن کاملGeoPeels: Deformation-Based Technique for Exploration of Geo-Referenced Networks
Spatial relations between geographical entities are typically visualized as a node-link diagram that is depicted over a geographical layout. The node-link diagram representation is well-suitable for tasks that require the analysis of the topology and properties of a spatial graph because it is more intuitive with respect to the matrix representation. However, the readability of node-link diagra...
متن کاملDensity-Based Opportunistic Broadcasting Protocol for Emergency Situations in V2X Networks
Vehicular-to-anything (V2X) technology is attractive for wireless vehicular ad-hoc networks (VANETs) because it allows for opportunistic choice of a vehicular protocol between vehicular-to-vehicular (V2V) and vehicular-to-infrastructure (V2I) communications. In particular, achieving seamless connectivity in a VANET with nearby network infrastructure is challenging. In this paper, we propose a d...
متن کاملAgent-based approach for cooperative scheduling
This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2019
ISSN: 0018-9545,1939-9359
DOI: 10.1109/tvt.2019.2924698